Adding Branching Temporal Dimension to Qualitative Coalitional Games with Preference
نویسندگان
چکیده
REGULAR PAPERS Handwritten Nushu Character Recognition Based on Hidden Markov Model Jiangqing Wang and Rongbo Zhu Semi-supervised Learning for SVM-KNN Kunlun Li, Xuerong Luo, and Ming Jin Exploration on Feature Extraction Schemes and Classifiers for Shaft Testing System Kyungmi Lee Design of Grid Resource Management System Based on Information Service Qian Zhang and Zhen Li Sampling Theorem Associated with Multiple-parameter Fractional Fourier Transform Qiwen Ran, Hui Zhao, Guixia Ge, Jing Ma, and Liying Tan The Optimized Comparison of the Gray Model Improved by Posterior-Error-Test and SVM Modified by Markov Residual Error in the Long-medium Power Load Forecast Wei Li and Zhen-gang Zhang Personalized Knowledge Acquisition through Interactive Data Analysis in E-learning System Zhongying Zhao, Shengzhong Feng, Qingtian Zeng, Jianping Fan, and Xiaohong Zhang Application of Chaos Mind Evolutionary Algorithm in Antenna Arrays Synthesis Jianxia Liu, Nan Li, and Keming Xie An Arbitrary-length and Multiplierless DCT Algorithm and Systolic Implementation Zhenbing Liu, Jianguo Liu, and Guoyou Wang Preserving Private Knowledge In Decision Tree Learning Weiwei Fang, Bingru Yang, and Dingli Song The Parameter’s Effect on the Stability in Microbial Growth Model Hong Men, Yuhong Li, and Fangbao Tian Adding Branching Temporal Dimension to Qualitative Coalitional Games with Preference Bailaing Cheng, Guosun Zeng, and Anquan Jie A New Method to Improve the Maneuver Capability of AUV Integrated Navigation Systems Zhen Guo, Yanling Hao, and Feng Sun A Hybrid Password Authentication Scheme Based on Shape and Text Ziran Zheng, Xiyu Liu, Lizi Yin, and Zhaocheng Liu A New Hybrid Method for Mobile Robot Dynamic Local Path Planning in Unknown Environment Peng Li, Xinhan Huang, and Min Wang 663
منابع مشابه
Logics for Qualitative Coalitional Games
Qualitative Coalitional Games (QCGs) are a variant of coalitional games in which an agent’s desires are represented as goals that are either satisfied or unsatisfied, and each choice available to a coalition is a set of goals, which would be jointly satisfied if the coalition made that choice. A coalition in a QCG will typically form in order to bring about a set of goals that will satisfy all ...
متن کاملOn the computational complexity of qualitative coalitional games
We study coalitional games in which agents are each assumed to have a goal to be achieved, and where the characteristic property of a coalition is a set of choices, with each choice denoting a set of goals that would be achieved if the choice was made. Such qualitative coalitional games (QCGs) are a natural tool for modelling goal-oriented multiagent systems. After introducing and formally defi...
متن کاملState and path coalition effectivity models for logics of multi-player games
We consider models of multi-player games where abilities of players and coalitions are defined in terms of sets of outcomes which they can effectively enforce. We extend the well studied state effectivity models of one-step games in two different ways. On the one hand, we develop multiple state effectivity functions associated with different longterm temporal operators. On the other hand, we de...
متن کاملPreferences in Qualitative Coalitional Games
Qualitative coalitional games (QCGs) are a variation of conventional coalitional games in which each coalition may choose to cooperate in a number of different ways, with different choices resulting in potentially different sets of goals being achieved; each agent is associated with a set of goals, the intuition being that an agent is “satisfied” if any of its goals are achieved, but is indiffe...
متن کاملRanking Sets of Possibly Interacting Objects Using Shapley Extensions
We deal with the problem of how to extend a preference relation over a set X of “objects” to the set of all subsets of X . This problem has been carried out in the tradition of the literature on extending an order on a set to its power set with the objective to analyze the axiomatic structure of families of rankings over subsets. In particular, most of these approaches make use of axioms aimed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JCP
دوره 5 شماره
صفحات -
تاریخ انتشار 2010